Infinite Probabilistic Databases

Probabilistic databases (PDBs) model uncertainty in data a quantitative way. In the established formal framework, probabilistic (relational) are finite probability spaces over relational database instances. This finiteness can clash with intuitive query behavior (Ceylan et al., KR 2016), and application scenarios that better modeled by continuous distributions (Dalvi CACM 2009). We formally introduced infinite PDBs (Grohe Lindner, PODS 2019) primary focus on countably spaces. However, an extension beyond countable raises nontrivial foundational issues concerned measurability of events queries ultimately question whether have well-defined semantics. argue point processes appropriate from theory for dealing general databases. allows us to construct suitable (uncountable) instances systematic Our main technical results statements algebra as well aggregate Datalog queries.